Maximum covering location problem to select facility location for operation timbang in the City of Iloilo, Philippines

نویسندگان

چکیده

Operation Timbang (OPT) Plus is one of the Philippines’ programs that focuses on nutrition by conducting an annual assessment for 0-59 months old children in barangays to identify malnutrition data area. The barangay smallest administrative entity Philippines. OPT a plan action estimates number individuals and identifies those who will get prioritized community. Iloilo City Health Office conducted program seven districts office planned establish community centre playground facility based priority/demand areas. Maximum Covering Location Problem (MCLP) used this study determine optimal location covers A Mathematical Programming Language (AMPL) apply mathematical programming MCLP. results can be maximum coverage demand points. experiment showed located Mandurriao District location. For Underweight/Severely Underweight children, total 646 are covered, Overweight/Obese, 1,041 covered chosen facility. In addition, findings sensitivity analysis indicate building three facilities case offer 100 percent required

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Maximum Facility Location Problem

In the maximum facility location problem, we are given a set of clients C and facilities F . Assigning a client u to a facility v incurs a cost w uv and each facility has an associated interval I v on the real line. Our goal is to assign as many clients to open facilities in order to maximise the cost of assignment, subject to the constraint that open facilities cannot have their respective int...

متن کامل

A cross entropy algorithm for continuous covering location problem

Covering problem tries to locate the least number of facilities and each demand has at least one facility located within a specific distance.This paper considers a cross entropy algorithm for solving the mixed integer nonlinear programming (MINLP) for covering location model.The model is solved to determine the best covering value.Also, this paper proposes aCross Entropy (CE) algorithm consider...

متن کامل

Reliable Capacitated Facility Location Problem Considering Maximal Covering

This paper provides a framework in order to incorporate reliability issue as a sign of disruption in distribution systems and partial covering theory as a response to limitation in coverage radios and economical preferences, simultaneously into the traditional literatures of capacitated facility location problems. As a result we develop a bi-objective model based on the discrete scenarios for e...

متن کامل

On the facility location problem: One-round weighted Voronoi game

Voronoi game presents a simple geometric model for Competitive facility location problems with two players. Voronoi game is played by two players known as White and Black, they play in a continuous arena. In the one-round game, White starts game and places all his points in the arena then Black places her points. Then the arena is divided by distance between two players and the player with the ...

متن کامل

Optimal Capacities in Discrete Facility Location Design Problem

Network location models comprise one of the main categories of location models. These models have various applications in regional and urban planning as well as in transportation, distribution, and energy management. In a network location problem, nodes represent demand points and candidate locations to locate the facilities. If the links network is unchangeably determined, the problem will be ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Jurnal Sistem dan Manajemen Industri

سال: 2022

ISSN: ['2580-2887', '2580-2895']

DOI: https://doi.org/10.30656/jsmi.v6i2.4599